Cartesian Cubical Type Theory

نویسندگان

  • Carlo Angiuli
  • Guillaume Brunerie
  • Thierry Coquand
  • Robert Harper
  • Daniel R. Licata
چکیده

We present a cubical type theory based on the Cartesian cube category (faces, degeneracies, symmetries, diagonals, but no connections or reversal) with univalent universes, each containing Π, Σ, path, identity, natural number, boolean, pushout, and glue (equivalence extension) types. The type theory includes a syntactic description of a uniform Kan operation, along with judgemental equality rules defining the Kan operation on each type. The Kan operation uses both a different set of trivial cofibrations and a different set of cofibrations than the Cohen, Coquand, Huber, and Mörtberg (CCHM) model. Next, we describe a constructive model in Cartesian cubical sets; the syntactic type theory is inspired by this model, though we have not yet given a formal interpretation. We describe a mechanized proof, using the internal language of cubical sets in the style introduced by Orton and Pitts, that glue, Π, Σ, path, identity, boolean, natural number, and pushout types are Kan in this model; we also sketch a proof that this internal construction implies univalent universes externally. An advantage of this formal approach is that our construction can also be interpreted in cubical sets on the connections cube category, and on the de Morgan cube category used in the CCHM model. As a first step towards comparing these approaches, we show that the two Kan operations are interderivable in a setting where both exist (presheaves on the de Morgan cube category, with the additional cofibration required by our construction).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Higher Type Theory III: Univalent Universes and Exact Equality

This is the third in a series of papers extending Martin-Löf’s meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higherdimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types; exact equality and other pretypes lacking Kan structure; and a cumulative hierarchy of pretype uni...

متن کامل

Cartesian Cubical Computational Type Theory

We present a dependent type theory organized around a Cartesian notion of cubes (with faces, degeneracies, and diagonals), supporting both fibrant and non-fibrant types. The fibrant fragment includes Voevodsky’s univalence axiom and a circle type, while the non-fibrant fragment includes exact (strict) equality types satisfying equality reflection. Our type theory is defined by a semantics in cu...

متن کامل

Cubical sets and the topological topos

Coquand’s cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the understanding of this model. We make three contributions: 1. Johnstone’s topological topos was created to present the geometric realization of simplicial se...

متن کامل

On Higher Inductive Types in Cubical Type Theory

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky’s univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly provable in the theory. This paper describes a constructive semantics, expressed in a presheaf topos with suitable structure inspired by cubical sets, of some...

متن کامل

Cubical Assemblies and Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredicative universe in a category of cubical assemblies. We show that the cubical assembly model does not satisfy the propositional resizing axiom.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017